Add to ORKGAbstract. We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many directions for further research. 1
Chapter 23 showed us how to build DL systems on the Jacobian of curves. In Chapter 1 we introduced D...
Pairings on elliptic curves recently obtained a lot of attention not only as a means to attack curve...
Chapter 23 showed us how to build DL systems on the Jacobian of curves. In Chapter 1 we introduced D...
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the rese...
Cryptosystems based on hyperelliptic curves were first presented by N. Koblitz, in 1989 (c.f. [11])....
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings ...
Abstract. The Weil and Tate pairings have been used recently to build new schemes in cryptography. I...
In recent papers [4], [9] they worked on hyperelliptic curves H b defined by y +y = x +x +b o...
Abstract. We survey recent research on pairings on hyperelliptic curves and present a comparison of ...
We survey recent research on pairings on hyperelliptic curves and present a comparison of the perfor...
La recherche de nouveaux groupes autres que le groupe multiplicatif pour concevoir des protocoles pl...
In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to h...
pairing implementation, high-security pairings, hyperelliptic curves, group law, Jacobian arithmetic...
In this thesis, I study two different aspects of elliptic and hyperelliptic curves based cryptograph...
In this thesis, I study two different aspects of elliptic and hyperelliptic curves based cryptograph...
Chapter 23 showed us how to build DL systems on the Jacobian of curves. In Chapter 1 we introduced D...
Pairings on elliptic curves recently obtained a lot of attention not only as a means to attack curve...
Chapter 23 showed us how to build DL systems on the Jacobian of curves. In Chapter 1 we introduced D...
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the rese...
Cryptosystems based on hyperelliptic curves were first presented by N. Koblitz, in 1989 (c.f. [11])....
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings ...
Abstract. The Weil and Tate pairings have been used recently to build new schemes in cryptography. I...
In recent papers [4], [9] they worked on hyperelliptic curves H b defined by y +y = x +x +b o...
Abstract. We survey recent research on pairings on hyperelliptic curves and present a comparison of ...
We survey recent research on pairings on hyperelliptic curves and present a comparison of the perfor...
La recherche de nouveaux groupes autres que le groupe multiplicatif pour concevoir des protocoles pl...
In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to h...
pairing implementation, high-security pairings, hyperelliptic curves, group law, Jacobian arithmetic...
In this thesis, I study two different aspects of elliptic and hyperelliptic curves based cryptograph...
In this thesis, I study two different aspects of elliptic and hyperelliptic curves based cryptograph...
Chapter 23 showed us how to build DL systems on the Jacobian of curves. In Chapter 1 we introduced D...
Pairings on elliptic curves recently obtained a lot of attention not only as a means to attack curve...
Chapter 23 showed us how to build DL systems on the Jacobian of curves. In Chapter 1 we introduced D...